#
# @lc app=leetcode.cn id=674 lang=python
#
# [674] 最长连续递增序列
#

# @lc code=start
class Solution(object):
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        dp = [1]*len(nums)
        result = 1
        for i in range(1, len(nums)):
            if nums[i]>nums[i-1]:
                dp[i] = dp[i-1]+1
            result = max(result, dp[i])
        return result
        
# @lc code=end

